Accuracy and Probabilism in Infinite Domains

Abstract The best accuracy arguments for probabilism apply only to credence functions with finite domains, that is, assign at most finitely many propositions. This is a significant limitation. It reveals the support accuracy-first programme in epistemology lot weaker than it seems first glance, and means cannot yet accomplish everything their competitors, pragmatic (Dutch book) arguments, can. In this paper, I investigate extent which limitation can be overcome. Building on present two are perfectly general—they arbitrary domains. then discuss how arguments’ premisses challenged. We will see particularly difficult characterize admissible measures infinite